Stochastic L-system inference from multiple string sequence inputs

Lindenmayer systems (L-systems) are a grammar system that consists of string rewriting rules. The rules replace every symbol in parallel with successor to produce the next string, and this procedure iterates. In stochastic context-free L-system (S0L-system), may have one or more rule, each an associated probability selection. Properly constructed been found be useful for modeling simulating some natural human engineered processes where derived describes step simulation. Typically, modeled by experts who meticulously construct based on measurements domain knowledge process. This paper presents automated approach finding L-systems, given set sequences as input. implemented tool is called Plant Model Inference Tool S0L-systems PMIT-S0L. PMIT-S0L evaluated using 960 procedurally generated test suite, which used generate input strings, then infer from only sequences. evaluation shows infers up 9 under 12 hours. Additionally, it 3 strings sufficient find correct original $$100\%$$ cases 6 reduce difference probabilities approximately $$1\%$$ less.